Decorated proofs for computational effects: Exceptions
نویسندگان
چکیده
We define a proof system for exceptions which is close to the syntax for exceptions, in the sense that the exceptions do not appear explicitly in the type of any expression. This proof system is sound with respect to the intended denotational semantics of exceptions. With this inference system we prove several properties of exceptions.
منابع مشابه
IMP with exceptions over decorated logic
In this paper, we facilitate the reasoning about impure programming languages, by annotating terms with “decorations” that describe what computational (side) effect evaluation of a term may involve. In a point-free categorical language, called the “decorated logic”, we formalize the mutable state and the exception effects first separately, and then combined, exploiting a nice duality between th...
متن کاملComputational studies of carbon decorated boron nitride nanocones
Density functional theory ,(DFT) calculations have been performed to investigate the properties ofcarbon decorated (C-decorated) models of boron nitride (BN) nanocones. To this aim, the apex andtip of nanocone have been substituted by the carbon atoms to represent the C-decorated models. Theresults indicated that dipole moments and energy gaps could reveal the effects of C-decorations onthe pro...
متن کاملA decorated proof system for exceptions
In this paper, we first provide a careful description of the denotational semantics of exceptions in an object-oriented setting. Then we define a proof system for exceptions which is sound with respect to this denotational semantics. Our proof system is close to the syntax, as in effect systems, in the sense that the exceptions do not appear explicitly in the type of expressions which may raise...
متن کاملProgram certification with computational effects
Dynamic evaluation is a paradigm in computer algebra which was introduced for computing with algebraic numbers. In linear algebra, for instance, dynamic evaluation can be used to apply programs which have been written for matrices with coefficients modulo some prime number to matrices with coefficients modulo some composite number. A way to implement dynamic evaluation in modern computing langu...
متن کاملDecorated proofs for computational effects: States
Abstract. The syntax of an imperative language does not mention explicitly the state, while its denotational semantics has to mention it. In this paper we show that the equational proofs about an imperative language may hide the state, in the same way as the syntax does. The syntax of an imperative language does not mention explicitly the state, while its denotational semantics has to mention i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1203.2900 شماره
صفحات -
تاریخ انتشار 2012